All Questions
4 questions
5votes
1answer
108views
How to merge two descending singly linkedlist into one ascending linkedlist using Recursion without any helper method?
Here is my solution: I want to know if my solution fits the requirement 100%? Or if there is any better solution? Constraint of the question: must be singly linkedlist must use recursion, and no ...
4votes
2answers
2kviews
Reverse a linked list recursively
This recursive calls reverseList on each node of the linked list. When returned from the function call, it changes the next link to the previous node. ...
- 363
4votes
3answers
8kviews
Recursive methods of singly linked list
Can anyone review the methods? If there are better ways to write a certain method I would appreciate it if anyone could tell me. ...
6votes
5answers
11kviews
Validating that all open/close parentheses are correctly matched
It returns true for: a*(b+c) ()() (()) ((!!(123(x)))) and returns false for: ...
